TSTP Solution File: ITP026^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP026^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:06:42 EDT 2024
% Result : Theorem 0.46s 0.77s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 29
% Syntax : Number of formulae : 75 ( 27 unt; 14 typ; 0 def)
% Number of atoms : 113 ( 31 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 337 ( 44 ~; 35 |; 3 &; 241 @)
% ( 3 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 72 ( 0 ^ 72 !; 0 ?; 72 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
set_a: $tType ).
thf(decl_sort2,type,
a: $tType ).
thf(decl_sort3,type,
nat: $tType ).
thf(decl_83,type,
minus_minus_nat: nat > nat > nat ).
thf(decl_87,type,
zero_zero_nat: nat ).
thf(decl_88,type,
suc: nat > nat ).
thf(decl_94,type,
ord_less_nat: nat > nat > $o ).
thf(decl_96,type,
ord_less_eq_nat: nat > nat > $o ).
thf(decl_112,type,
member_a: a > set_a > $o ).
thf(decl_115,type,
h1: set_a ).
thf(decl_119,type,
g: nat > a ).
thf(decl_120,type,
h2: a ).
thf(decl_121,type,
m2: nat ).
thf(decl_124,type,
xa: nat ).
thf(fact_184_less__or__eq__imp__le,axiom,
! [X220: nat,X8: nat] :
( ( ( ord_less_nat @ X220 @ X8 )
| ( X220 = X8 ) )
=> ( ord_less_eq_nat @ X220 @ X8 ) ),
file('/export/starexec/sandbox/tmp/tmp.DPVuFEvxIp/E---3.1_19581.p',fact_184_less__or__eq__imp__le) ).
thf(conj_21,conjecture,
member_a @ ( g @ xa ) @ h1,
file('/export/starexec/sandbox/tmp/tmp.DPVuFEvxIp/E---3.1_19581.p',conj_21) ).
thf(fact_196_not__less__eq,axiom,
! [X234: nat,X8: nat] :
( ~ ( ord_less_nat @ X234 @ X8 )
<=> ( ord_less_nat @ X8 @ ( suc @ X234 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.DPVuFEvxIp/E---3.1_19581.p',fact_196_not__less__eq) ).
thf(conj_1,hypothesis,
! [X401: nat] :
( ( ord_less_eq_nat @ X401 @ m2 )
=> ! [X170: nat] :
( ( ord_less_eq_nat @ X170 @ m2 )
=> ( ( ( g @ X401 )
= ( g @ X170 ) )
=> ( X401 = X170 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.DPVuFEvxIp/E---3.1_19581.p',conj_1) ).
thf(fact_236_le__imp__less__Suc,axiom,
! [X277: nat,X8: nat] :
( ( ord_less_eq_nat @ X277 @ X8 )
=> ( ord_less_nat @ X277 @ ( suc @ X8 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.DPVuFEvxIp/E---3.1_19581.p',fact_236_le__imp__less__Suc) ).
thf(conj_3,hypothesis,
( ( g @ m2 )
= h2 ),
file('/export/starexec/sandbox/tmp/tmp.DPVuFEvxIp/E---3.1_19581.p',conj_3) ).
thf(conj_20,hypothesis,
( ( ( g @ xa )
= h2 )
| ( member_a @ ( g @ xa ) @ h1 ) ),
file('/export/starexec/sandbox/tmp/tmp.DPVuFEvxIp/E---3.1_19581.p',conj_20) ).
thf(fact_238_less__Suc__eq__le,axiom,
! [X278: nat,X8: nat] :
( ( ord_less_nat @ X278 @ ( suc @ X8 ) )
<=> ( ord_less_eq_nat @ X278 @ X8 ) ),
file('/export/starexec/sandbox/tmp/tmp.DPVuFEvxIp/E---3.1_19581.p',fact_238_less__Suc__eq__le) ).
thf(conj_19,hypothesis,
ord_less_eq_nat @ xa @ ( minus_minus_nat @ m2 @ ( suc @ zero_zero_nat ) ),
file('/export/starexec/sandbox/tmp/tmp.DPVuFEvxIp/E---3.1_19581.p',conj_19) ).
thf(fact_222_less__imp__diff__less,axiom,
! [X173: nat,X104: nat,X8: nat] :
( ( ord_less_nat @ X173 @ X104 )
=> ( ord_less_nat @ ( minus_minus_nat @ X173 @ X8 ) @ X104 ) ),
file('/export/starexec/sandbox/tmp/tmp.DPVuFEvxIp/E---3.1_19581.p',fact_222_less__imp__diff__less) ).
thf(fact_140_linorder__neqE__nat,axiom,
! [X176: nat,X175: nat] :
( ( X176 != X175 )
=> ( ~ ( ord_less_nat @ X176 @ X175 )
=> ( ord_less_nat @ X175 @ X176 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.DPVuFEvxIp/E---3.1_19581.p',fact_140_linorder__neqE__nat) ).
thf(fact_254_diff__less__Suc,axiom,
! [X293: nat,X8: nat] : ( ord_less_nat @ ( minus_minus_nat @ X293 @ X8 ) @ ( suc @ X293 ) ),
file('/export/starexec/sandbox/tmp/tmp.DPVuFEvxIp/E---3.1_19581.p',fact_254_diff__less__Suc) ).
thf(fact_138_n__not__Suc__n,axiom,
! [X8: nat] :
( X8
!= ( suc @ X8 ) ),
file('/export/starexec/sandbox/tmp/tmp.DPVuFEvxIp/E---3.1_19581.p',fact_138_n__not__Suc__n) ).
thf(fact_38_Suc__pred,axiom,
! [X8: nat] :
( ( ord_less_nat @ zero_zero_nat @ X8 )
=> ( ( suc @ ( minus_minus_nat @ X8 @ ( suc @ zero_zero_nat ) ) )
= X8 ) ),
file('/export/starexec/sandbox/tmp/tmp.DPVuFEvxIp/E---3.1_19581.p',fact_38_Suc__pred) ).
thf(conj_16,hypothesis,
ord_less_nat @ zero_zero_nat @ m2,
file('/export/starexec/sandbox/tmp/tmp.DPVuFEvxIp/E---3.1_19581.p',conj_16) ).
thf(c_0_15,plain,
! [X979: nat,X980: nat] :
( ( ~ ( ord_less_nat @ X979 @ X980 )
| ( ord_less_eq_nat @ X979 @ X980 ) )
& ( ( X979 != X980 )
| ( ord_less_eq_nat @ X979 @ X980 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_184_less__or__eq__imp__le])])])]) ).
thf(c_0_16,negated_conjecture,
~ ( member_a @ ( g @ xa ) @ h1 ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_21])]) ).
thf(c_0_17,plain,
! [X234: nat,X8: nat] :
( ~ ( ord_less_nat @ X234 @ X8 )
<=> ( ord_less_nat @ X8 @ ( suc @ X234 ) ) ),
inference(fof_simplification,[status(thm)],[fact_196_not__less__eq]) ).
thf(c_0_18,hypothesis,
! [X839: nat,X840: nat] :
( ~ ( ord_less_eq_nat @ X839 @ m2 )
| ~ ( ord_less_eq_nat @ X840 @ m2 )
| ( ( g @ X839 )
!= ( g @ X840 ) )
| ( X839 = X840 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_1])])])]) ).
thf(c_0_19,plain,
! [X8: nat,X11: nat] :
( ( ord_less_eq_nat @ X8 @ X11 )
| ( X8 != X11 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_20,negated_conjecture,
~ ( member_a @ ( g @ xa ) @ h1 ),
inference(fof_nnf,[status(thm)],[c_0_16]) ).
thf(c_0_21,plain,
! [X1022: nat,X1023: nat] :
( ( ( ord_less_nat @ X1022 @ X1023 )
| ( ord_less_nat @ X1023 @ ( suc @ X1022 ) ) )
& ( ~ ( ord_less_nat @ X1023 @ ( suc @ X1022 ) )
| ~ ( ord_less_nat @ X1022 @ X1023 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
thf(c_0_22,plain,
! [X1058: nat,X1059: nat] :
( ~ ( ord_less_eq_nat @ X1058 @ X1059 )
| ( ord_less_nat @ X1058 @ ( suc @ X1059 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_236_le__imp__less__Suc])])]) ).
thf(c_0_23,hypothesis,
! [X8: nat,X11: nat] :
( ( X8 = X11 )
| ~ ( ord_less_eq_nat @ X8 @ m2 )
| ~ ( ord_less_eq_nat @ X11 @ m2 )
| ( ( g @ X8 )
!= ( g @ X11 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_24,hypothesis,
( ( g @ m2 )
= h2 ),
inference(split_conjunct,[status(thm)],[conj_3]) ).
thf(c_0_25,plain,
! [X8: nat] : ( ord_less_eq_nat @ X8 @ X8 ),
inference(er,[status(thm)],[c_0_19]) ).
thf(c_0_26,hypothesis,
( ( ( g @ xa )
= h2 )
| ( member_a @ ( g @ xa ) @ h1 ) ),
inference(split_conjunct,[status(thm)],[conj_20]) ).
thf(c_0_27,negated_conjecture,
~ ( member_a @ ( g @ xa ) @ h1 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_28,plain,
! [X1061: nat,X1062: nat] :
( ( ~ ( ord_less_nat @ X1061 @ ( suc @ X1062 ) )
| ( ord_less_eq_nat @ X1061 @ X1062 ) )
& ( ~ ( ord_less_eq_nat @ X1061 @ X1062 )
| ( ord_less_nat @ X1061 @ ( suc @ X1062 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_238_less__Suc__eq__le])])]) ).
thf(c_0_29,plain,
! [X11: nat,X8: nat] :
( ~ ( ord_less_nat @ X8 @ ( suc @ X11 ) )
| ~ ( ord_less_nat @ X11 @ X8 ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_30,plain,
! [X8: nat,X11: nat] :
( ( ord_less_nat @ X8 @ ( suc @ X11 ) )
| ~ ( ord_less_eq_nat @ X8 @ X11 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_31,hypothesis,
! [X8: nat] :
( ( X8 = m2 )
| ( ( g @ X8 )
!= h2 )
| ~ ( ord_less_eq_nat @ X8 @ m2 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
thf(c_0_32,hypothesis,
( ( g @ xa )
= h2 ),
inference(sr,[status(thm)],[c_0_26,c_0_27]) ).
thf(c_0_33,plain,
! [X8: nat,X11: nat] :
( ( ord_less_eq_nat @ X8 @ X11 )
| ~ ( ord_less_nat @ X8 @ ( suc @ X11 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_34,plain,
! [X11: nat,X8: nat] :
( ( ord_less_nat @ X8 @ X11 )
| ( ord_less_nat @ X11 @ ( suc @ X8 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_35,plain,
! [X11: nat,X8: nat] :
( ~ ( ord_less_nat @ X8 @ X11 )
| ~ ( ord_less_eq_nat @ X11 @ X8 ) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
thf(c_0_36,hypothesis,
ord_less_eq_nat @ xa @ ( minus_minus_nat @ m2 @ ( suc @ zero_zero_nat ) ),
inference(split_conjunct,[status(thm)],[conj_19]) ).
thf(c_0_37,plain,
! [X1232: nat,X1233: nat,X1234: nat] :
( ~ ( ord_less_nat @ X1232 @ X1233 )
| ( ord_less_nat @ ( minus_minus_nat @ X1232 @ X1234 ) @ X1233 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_222_less__imp__diff__less])])]) ).
thf(c_0_38,hypothesis,
( ( m2 = xa )
| ~ ( ord_less_eq_nat @ xa @ m2 ) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
thf(c_0_39,plain,
! [X11: nat,X8: nat] :
( ( ord_less_nat @ X8 @ X11 )
| ( ord_less_eq_nat @ X11 @ X8 ) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
thf(c_0_40,hypothesis,
~ ( ord_less_nat @ ( minus_minus_nat @ m2 @ ( suc @ zero_zero_nat ) ) @ xa ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
thf(c_0_41,plain,
! [X8: nat,X12: nat,X11: nat] :
( ( ord_less_nat @ ( minus_minus_nat @ X8 @ X12 ) @ X11 )
| ~ ( ord_less_nat @ X8 @ X11 ) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
thf(c_0_42,hypothesis,
( ( m2 = xa )
| ( ord_less_nat @ m2 @ xa ) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
thf(c_0_43,hypothesis,
~ ( ord_less_nat @ m2 @ xa ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
thf(c_0_44,plain,
! [X176: nat,X175: nat] :
( ( X176 != X175 )
=> ( ~ ( ord_less_nat @ X176 @ X175 )
=> ( ord_less_nat @ X175 @ X176 ) ) ),
inference(fof_simplification,[status(thm)],[fact_140_linorder__neqE__nat]) ).
thf(c_0_45,plain,
! [X1246: nat,X1247: nat] : ( ord_less_nat @ ( minus_minus_nat @ X1246 @ X1247 ) @ ( suc @ X1246 ) ),
inference(variable_rename,[status(thm)],[fact_254_diff__less__Suc]) ).
thf(c_0_46,hypothesis,
m2 = xa,
inference(sr,[status(thm)],[c_0_42,c_0_43]) ).
thf(c_0_47,plain,
! [X954: nat,X955: nat] :
( ( X954 = X955 )
| ( ord_less_nat @ X954 @ X955 )
| ( ord_less_nat @ X955 @ X954 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_44])]) ).
thf(c_0_48,plain,
! [X11: nat,X8: nat] : ( ord_less_nat @ ( minus_minus_nat @ X8 @ X11 ) @ ( suc @ X8 ) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
thf(c_0_49,plain,
! [X8: nat] :
( X8
!= ( suc @ X8 ) ),
inference(fof_simplification,[status(thm)],[fact_138_n__not__Suc__n]) ).
thf(c_0_50,plain,
! [X1186: nat] :
( ~ ( ord_less_nat @ zero_zero_nat @ X1186 )
| ( ( suc @ ( minus_minus_nat @ X1186 @ ( suc @ zero_zero_nat ) ) )
= X1186 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_38_Suc__pred])])]) ).
thf(c_0_51,hypothesis,
~ ( ord_less_nat @ ( minus_minus_nat @ xa @ ( suc @ zero_zero_nat ) ) @ xa ),
inference(spm,[status(thm)],[c_0_40,c_0_46]) ).
thf(c_0_52,plain,
! [X11: nat,X8: nat] :
( ( X8 = X11 )
| ( ord_less_nat @ X8 @ X11 )
| ( ord_less_nat @ X11 @ X8 ) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
thf(c_0_53,plain,
! [X8: nat,X11: nat] :
~ ( ord_less_nat @ X8 @ ( minus_minus_nat @ X8 @ X11 ) ),
inference(spm,[status(thm)],[c_0_29,c_0_48]) ).
thf(c_0_54,hypothesis,
ord_less_nat @ zero_zero_nat @ m2,
inference(split_conjunct,[status(thm)],[conj_16]) ).
thf(c_0_55,plain,
! [X1263: nat] :
( X1263
!= ( suc @ X1263 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_49])]) ).
thf(c_0_56,plain,
! [X8: nat] :
( ( ( suc @ ( minus_minus_nat @ X8 @ ( suc @ zero_zero_nat ) ) )
= X8 )
| ~ ( ord_less_nat @ zero_zero_nat @ X8 ) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
thf(c_0_57,hypothesis,
( ( minus_minus_nat @ xa @ ( suc @ zero_zero_nat ) )
= xa ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
thf(c_0_58,hypothesis,
ord_less_nat @ zero_zero_nat @ xa,
inference(rw,[status(thm)],[c_0_54,c_0_46]) ).
thf(c_0_59,plain,
! [X8: nat] :
( X8
!= ( suc @ X8 ) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
thf(c_0_60,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]),c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.19 % Problem : ITP026^1 : TPTP v8.1.2. Released v7.5.0.
% 0.12/0.20 % Command : run_E %s %d THM
% 0.19/0.41 % Computer : n028.cluster.edu
% 0.19/0.41 % Model : x86_64 x86_64
% 0.19/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.41 % Memory : 8042.1875MB
% 0.19/0.41 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.41 % CPULimit : 300
% 0.19/0.41 % WCLimit : 300
% 0.19/0.41 % DateTime : Fri May 3 12:37:19 EDT 2024
% 0.19/0.41 % CPUTime :
% 0.43/0.60 Running higher-order theorem proving
% 0.43/0.60 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.DPVuFEvxIp/E---3.1_19581.p
% 0.46/0.77 # Version: 3.1.0-ho
% 0.46/0.77 # Preprocessing class: HSLMSMSMSSLNHSA.
% 0.46/0.77 # Scheduled 7 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.77 # Starting new_bool_8 with 600s (2) cores
% 0.46/0.77 # Starting new_ho_3 with 300s (1) cores
% 0.46/0.77 # Starting additional_ho_3 with 300s (1) cores
% 0.46/0.77 # Starting full_lambda_10 with 300s (1) cores
% 0.46/0.77 # Starting ehoh_best with 300s (1) cores
% 0.46/0.77 # Starting sh2lt with 300s (1) cores
% 0.46/0.77 # Starting full_lambda_4 with 300s (1) cores
% 0.46/0.77 # new_bool_8 with pid 19731 completed with status 0
% 0.46/0.77 # Result found by new_bool_8
% 0.46/0.77 # Preprocessing class: HSLMSMSMSSLNHSA.
% 0.46/0.77 # Scheduled 7 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.77 # Starting new_bool_8 with 600s (2) cores
% 0.46/0.77 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.46/0.77 # Search class: HGHSM-FSLM31-MHSFFSBN
% 0.46/0.77 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.46/0.77 # Starting almost_fo_1 with 325s (1) cores
% 0.46/0.77 # Starting new_bool_8 with 61s (1) cores
% 0.46/0.77 # almost_fo_1 with pid 19738 completed with status 0
% 0.46/0.77 # Result found by almost_fo_1
% 0.46/0.77 # Preprocessing class: HSLMSMSMSSLNHSA.
% 0.46/0.77 # Scheduled 7 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.77 # Starting new_bool_8 with 600s (2) cores
% 0.46/0.77 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.46/0.77 # Search class: HGHSM-FSLM31-MHSFFSBN
% 0.46/0.77 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.46/0.77 # Starting almost_fo_1 with 325s (1) cores
% 0.46/0.77 # Preprocessing time : 0.006 s
% 0.46/0.77 # Presaturation interreduction done
% 0.46/0.77
% 0.46/0.77 # Proof found!
% 0.46/0.77 # SZS status Theorem
% 0.46/0.77 # SZS output start CNFRefutation
% See solution above
% 0.46/0.77 # Parsed axioms : 493
% 0.46/0.77 # Removed by relevancy pruning/SinE : 295
% 0.46/0.77 # Initial clauses : 329
% 0.46/0.77 # Removed in clause preprocessing : 4
% 0.46/0.77 # Initial clauses in saturation : 325
% 0.46/0.77 # Processed clauses : 1293
% 0.46/0.77 # ...of these trivial : 73
% 0.46/0.77 # ...subsumed : 553
% 0.46/0.77 # ...remaining for further processing : 667
% 0.46/0.77 # Other redundant clauses eliminated : 56
% 0.46/0.77 # Clauses deleted for lack of memory : 0
% 0.46/0.77 # Backward-subsumed : 8
% 0.46/0.77 # Backward-rewritten : 56
% 0.46/0.77 # Generated clauses : 3179
% 0.46/0.77 # ...of the previous two non-redundant : 2764
% 0.46/0.77 # ...aggressively subsumed : 0
% 0.46/0.77 # Contextual simplify-reflections : 1
% 0.46/0.77 # Paramodulations : 3114
% 0.46/0.77 # Factorizations : 4
% 0.46/0.77 # NegExts : 0
% 0.46/0.77 # Equation resolutions : 59
% 0.46/0.77 # Disequality decompositions : 0
% 0.46/0.77 # Total rewrite steps : 888
% 0.46/0.77 # ...of those cached : 779
% 0.46/0.77 # Propositional unsat checks : 0
% 0.46/0.77 # Propositional check models : 0
% 0.46/0.77 # Propositional check unsatisfiable : 0
% 0.46/0.77 # Propositional clauses : 0
% 0.46/0.77 # Propositional clauses after purity: 0
% 0.46/0.77 # Propositional unsat core size : 0
% 0.46/0.77 # Propositional preprocessing time : 0.000
% 0.46/0.77 # Propositional encoding time : 0.000
% 0.46/0.77 # Propositional solver time : 0.000
% 0.46/0.77 # Success case prop preproc time : 0.000
% 0.46/0.77 # Success case prop encoding time : 0.000
% 0.46/0.77 # Success case prop solver time : 0.000
% 0.46/0.77 # Current number of processed clauses : 323
% 0.46/0.77 # Positive orientable unit clauses : 83
% 0.46/0.77 # Positive unorientable unit clauses: 3
% 0.46/0.77 # Negative unit clauses : 34
% 0.46/0.77 # Non-unit-clauses : 203
% 0.46/0.77 # Current number of unprocessed clauses: 1947
% 0.46/0.77 # ...number of literals in the above : 5170
% 0.46/0.77 # Current number of archived formulas : 0
% 0.46/0.77 # Current number of archived clauses : 314
% 0.46/0.77 # Clause-clause subsumption calls (NU) : 12011
% 0.46/0.77 # Rec. Clause-clause subsumption calls : 8975
% 0.46/0.77 # Non-unit clause-clause subsumptions : 230
% 0.46/0.77 # Unit Clause-clause subsumption calls : 920
% 0.46/0.77 # Rewrite failures with RHS unbound : 0
% 0.46/0.77 # BW rewrite match attempts : 63
% 0.46/0.77 # BW rewrite match successes : 21
% 0.46/0.77 # Condensation attempts : 0
% 0.46/0.77 # Condensation successes : 0
% 0.46/0.77 # Termbank termtop insertions : 63629
% 0.46/0.77 # Search garbage collected termcells : 9389
% 0.46/0.77
% 0.46/0.77 # -------------------------------------------------
% 0.46/0.77 # User time : 0.122 s
% 0.46/0.77 # System time : 0.009 s
% 0.46/0.77 # Total time : 0.131 s
% 0.46/0.77 # Maximum resident set size: 3904 pages
% 0.46/0.77
% 0.46/0.77 # -------------------------------------------------
% 0.46/0.77 # User time : 0.235 s
% 0.46/0.77 # System time : 0.021 s
% 0.46/0.77 # Total time : 0.255 s
% 0.46/0.77 # Maximum resident set size: 2612 pages
% 0.46/0.77 % E---3.1 exiting
% 0.46/0.77 % E exiting
%------------------------------------------------------------------------------